基于PIC单片机控制格斗机器人的研究

研究了基于PIC单片机为控制核心的格斗机器人.该机器人由动力系统、机械系统和控制系统组成,其控制系统主要由PIC单片机、电机驱动电路和传感器模块三部分组成.在机器人控制系统的软件设计中,采用了自救、搜索和攻击算法.利用灰度传感器和接近传感器将信号经模数转化为14位数字量.在精度问题上,通过软件实现只取其中的高8位,并在实际对抗中,取得较好的效果.     

一类全系数模糊规划问题及其求解方法

模糊规划是不确定规划的重要一类,对许多带有模糊信息的实际问题都能进行有效地处理,对模糊规划的求解方法进行讨论不仅具有理论意义,还具有实际意义.为寻求一类全系数模糊规划问题的求解方法,利用三角(或梯形)模糊数的排序准则并结合禁忌搜索算法设计了一种求解系数均为三角(或梯形)模糊数的规划模型的人工智能算法.数值算例表明笔者所提方法行之有效.     

对搜索雷达的噪声压制干扰效果评估

针对噪声压制干扰对搜索雷达的干扰效果评估问题,在对干扰效果的评估准则和指标进行详细分析的基础上,指出了不同准则及各种指标之间的内在联系;并提出采用烧穿距离作为搜索雷达的噪声压制干扰效果评估指标并进行了计算机仿真,仿真结果与理论分析相吻合。     

SIPO专利检索资源之药物专利检索系统

本文主要介绍了SIPO专利检索资源之药物专利检索系统(简称CHMP),包括CHMP旧版和新版。文中对CHMP旧版和新版的基本使用方法做了介绍,有助于用户快速入门和了解其基本功能,提高对药物专利检索的兴趣和效率;文中最后指出目前CHMP两个版本功能上存在差异会导致用户选择困难。     

快速成型中STL模型直接切片新算法研究

提出基于快速成型中STL模型直接切片新算法。读取二进制STL模型信息,创建三角面片矩阵;采用二分查找算法实现三角面片与切平面相交分组;再对每一组中三角面片与相交切平面求其交点获得相交线段,去除相交线段间的冗余节点;最后用深度优先搜索算法对切平面中相交线段优化创建轮廓线路径。此算法避免了切平面与三角面片位置关系的判断和建立三角面片之间拓扑信息关系,在切片耗时上具有明显的优势。     

Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem

The multi-objective flexible job shop scheduling problem is solved using a novel path-relinking algorithm based on the state-of-the-art Tabu search algorithm with back-jump tracking. A routing solution is identified by problem-specific neighborhood search, and is then further refined by the Tabu search algorithm with back-jump tracking for a sequencing decision. The resultant solution is used to maintain the medium-term memory where the best solutions are stored. A path-relinking heuristics is designed to generate diverse solutions in the most promising areas. An improved version of the algorithm is then developed by incorporating an effective dimension-oriented intensification search to find solutions that are located near extreme solutions. The proposed algorithms are tested on benchmark instances and its experimental performance is compared with that of algorithms in the literature. Comparison results show that the proposed algorithms are competitive in terms of its computation performance and solution quality.     

Conformational Study of the Structure of dibenzo-18-crown-6. Comparison with 18-crown-6

We report for the first time the conformational analysis of dibenzo-18-crown-6, db18c6. The conformational search was carried out using the CONFLEX conformational search method of cyclic molecules. Energies were calculated for the low-lying predicted conformations at different levels of theory up to the G3MP2 level. At the G3MP2 level, the predicted ground state (GS) conformation was more stable than the experimental conformation by only 1.60 kcal/mol. Strong similarity was found between the GS structure and experimental conformations of db18c6 and 18-crown-6, 18c6. The GS and experimental conformations of db18c6 are non-planar. This allows db18c6 to exist in optically active enantiomers. Similar to 18c6, it was concluded that the db18c6 structure is stabilized by intramolecular hydrogen bond. We also performed the computations for the water and chloroform solution phase, where the same conformation was predicted as the GS conformation.     

Succession of hide–seek and pursuit–evasion at heterogeneous locations

Many interactions between searching agents and their elusive targets are composed of a succession of steps, whether in the context of immune systems, predation or counterterrorism. In the simplest case, a two-step process starts with a search-and-hide phase, also called a hide-and-seek phase, followed by a round of pursuit–escape. Our aim is to link these two processes, usually analysed separately and with different models, in a single game theory context. We define a matrix game in which a searcher looks at a fixed number of discrete locations only once each searching for a hider, which can escape with varying probabilities according to its location. The value of the game is the overall probability of capture after k looks. The optimal search and hide strategies are described. If a searcher looks only once into any of the locations, an optimal hider chooses it''s hiding place so as to make all locations equally attractive. This optimal strategy remains true as long as the number of looks is below an easily calculated threshold; however, above this threshold, the optimal position for the hider is where it has the highest probability of escaping once spotted.     

Mixing and Simplex Search for Optimal Illumination in Machine Vision

Mixed-color illumination affects the quality of images in industrial vision system and it is important to optimize color and intensity for image acquisition. This study used simplex search to find the optimal illumination in a short amount of time. A typical color mixer synthesized various color of lights by changing the inputs of RGB power LEDs and passing the lights through an optical system. The image quality under mixed-color illumination was calculated according to the sharpness. For the purpose of optimal illumination using simplex search, a probe network was organized with N + 1probing points for N inputs. The shape of the probe network, simplex, was varied through procedures of extension, contraction, and shrinkage. The inputs of the color mixer were changed until the size of the simplex became smaller than a threshold. The simplex search was tested for commercial semiconductor patterns, and was useful for finding the optimal illumination.     

Breakout local search for the multi-objective gate allocation problem

The problem of assigning gates to arriving and departing flights is one of the most important problems in airport operations. We take into account the real multi-criteria nature of the problem by optimizing a total of nine gate allocation objectives that are oriented both on convenience for airport/airline services and passenger comfort. As far as we are aware, this is the largest number of objectives jointly optimized in the GAP literature. Given the complexity of the considered problem, we propose a heuristic approach based on the Breakout Local Search (BLS) framework. BLS is a recent variant of the Iterated Local Search (ILS) with a particular focus on the perturbation strategy. Based on some relevant information on search history, it tries to introduce an appropriate degree of diversification by determining adaptively the number and type of moves for the next perturbation phase. Moreover, we use a new memory-based greedy constructive heuristic to generate a starting point for BLS. Benchmark instances used for our experiments and comparisons are based on information provided by Manchester Airport.